Calculating modules in contextual logic program refinement

Calculating modules in contextual logic program refinement

The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work on contextual refinement. Contextual refinement simplifies the refinement p...

A Program Logic for Contextual Refinement of Concurrent Objects under Fair Scheduling

Existing program logics on concurrent object verification either ignore progress properties, or aim for non-blocking progress (e.g., lock-freedom and wait-freedom), which cannot be applied to blocking algorithms that progress only under fair scheduling. In this paper we propose a new program logic for compositional verification of contextual refinement of concurrent objects under fair schedulin...

Abstraction Refinement for Separation Logic Program Analyses

ion Refinement for Separation Logic Program Analyses Matko Botinčan, Mike Dodds, and Stephen Magill 1 University of Cambridge, {matko.botincan,mike.dodds}@cl.cam.ac.uk 2 [email protected] Abstract. Abstract domains based on separation logic allow the compositional analysis of heap-manipulating programs, and their effectiveness on real-world software has been extensively demonstrated. Tra...

A Tool for Logic Program Refinement

The re nement calculus provides a method for transforming speci cations to executable code, maintaining the correctness of the code with respect to its speci cation. In the original re nement calculus, the target language is an imperative programming language, but more recently a re nement calculus for deriving logic programs has been proposed. Due to the amount of detail involved, the manual r...

Semi-automatic Program Refinement from Specifications Using Library Modules